5,469 research outputs found

    Paramagnetic Materials and Practical Algorithmic Cooling for NMR Quantum Computing

    Full text link
    Algorithmic Cooling is a method that uses novel data compression techniques and simplecquantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A reversible entropy compression of the computation quantum-bits (qubits) of the system and an irreversible heat transfer from the system to the environment through a set of reset qubits that reach thermal relaxation rapidly. Is it possible to experimentally demonstrate algorithmic cooling using existing technology? To allow experimental algorithmic cooling, the thermalization time of the reset qubits must be much shorter than the thermalization time of the computation qubits. However such thermalization-times ratios have yet to be reported. We investigate here the effect of a paramagnetic salt on the thermalization-times ratio of computation qubits (carbons) and a reset qubit (hydrogen). We show that the thermalization-times ratio is improved by approximately three-fold. Based on this result, an experimental demonstration of algorithmic cooling by thermalization and magnetic ions is currently performed by our group and collaborators.Comment: 5 pages, A conference version of this paper appeared in SPIE, volume 5105, pages 185-194 (2003

    Algorithmic Cooling of Spins: A Practicable Method for Increasing Polarization

    Full text link
    An efficient technique to generate ensembles of spins that are highly polarized by external magnetic fields is the Holy Grail in Nuclear Magnetic Resonance (NMR) spectroscopy. Since spin-half nuclei have steady-state polarization biases that increase inversely with temperature, spins exhibiting high polarization biases are considered cool, even when their environment is warm. Existing spin-cooling techniques are highly limited in their efficiency and usefulness. Algorithmic cooling is a promising new spin-cooling approach that employs data compression methods in open systems. It reduces the entropy of spins on long molecules to a point far beyond Shannon's bound on reversible entropy manipulations (an information-theoretic version of the 2nd Law of Thermodynamics), thus increasing their polarization. Here we present an efficient and experimentally feasible algorithmic cooling technique that cools spins to very low temperatures even on short molecules. This practicable algorithmic cooling could lead to breakthroughs in high-sensitivity NMR spectroscopy in the near future, and to the development of scalable NMR quantum computers in the far future. Moreover, while the cooling algorithm itself is classical, it uses quantum gates in its implementation, thus representing the first short-term application of quantum computing devices.Comment: 24 pages (with annexes), 3 figures (PS). This version contains no major content changes: fixed bibliography & figures, modified acknowledgement

    Optimal Universal Disentangling Machine for Two Qubit Quantum States

    Full text link
    We derive the optimal curve satisfied by the reduction factors, in the case of universal disentangling machine which uses only local operations. Impossibility of constructing a better disentangling machine, by using non-local operations, is discussed.Comment: 15 pages, 2 eps figures, 1 section added, 1 eps figure added, minor corrections, 2 reference numbers correcte

    Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement

    Get PDF
    We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bound entangled states based on product bases which are only completable in a locally extended Hilbert space. We introduce a very useful representation of a product basis, an orthogonality graph. Using this representation we give a complete characterization of unextendible product bases for two qutrits. We present several generalizations of UPBs to arbitrary high dimensions and multipartite systems. We present a sufficient condition for sets of orthogonal product states to be distinguishable by separable superoperators. We prove that bound entangled states cannot help increase the distillable entanglement of a state beyond its regularized entanglement of formation assisted by bound entanglement.Comment: 24 pages RevTex, 15 figures; appendix removed, several small corrections, to appear in Comm. Math. Phy

    Quantum disentanglers

    Get PDF
    It is not possible to disentangle a qubit in an unknown state ∣ψ>|\psi> from a set of (N-1) ancilla qubits prepared in a specific reference state ∣0>|0>. That is, it is not possible to {\em perfectly} perform the transformation (∣ψ,0...,0+˚∣0,ψ,...,0+˚...+∣0,0,...ψ)˚→∣0,...,0>⊗∣ψ>(|\psi,0...,0\r +|0,\psi,...,0\r +...+ |0,0,...\psi\r) \to |0,...,0>\otimes |\psi>. The question is then how well we can do? We consider a number of different methods of extracting an unknown state from an entangled state formed from that qubit and a set of ancilla qubits in an known state. Measuring the whole system is, as expected, the least effective method. We present various quantum ``devices'' which disentangle the unknown qubit from the set of ancilla qubits. In particular, we present the optimal universal disentangler which disentangles the unknown qubit with the fidelity which does not depend on the state of the qubit, and a probabilistic disentangler which performs the perfect disentangling transformation, but with a probability less than one.Comment: 8 pages, 1 eps figur

    Perfect state transfers by selective quantum interferences within complex spin networks

    Full text link
    We present a method that implement directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time-domain. That provides a tool to isolate subsystems from a large and complex one. Directionality is achieved by interrupting the spin-spin coupled evolution with periods of free Zeeman evolutions, whose timing is tuned to be commensurate with the relative phases accrued by specific spin pairs. This leads to a resonant transfer between the chosen qubits, and to a detuning of all remaining pathways in the network, using only global manipulations. As the transfer is perfect when the selected pathway is mediated by 2 or 3 spins, distant state transfers over complex networks can be achieved by successive recouplings among specific pairs/triads of spins. These effects are illustrated with a quantum simulator involving 13C NMR on Leucine's backbone; a six-spin network.Comment: 5 pages, 3 figure

    Finite lifetime eigenfunctions of coupled systems of harmonic oscillators

    Full text link
    We find a Hermite-type basis for which the eigenvalue problem associated to the operator HA,B:=B(−∂x2)+Ax2H_{A,B}:=B(-\partial_x^2)+Ax^2 acting on L2(R;C2)L^2({\bf R};{\bf C}^2) becomes a three-terms recurrence. Here AA and BB are two constant positive definite matrices with no other restriction. Our main result provides an explicit characterization of the eigenvectors of HA,BH_{A,B} that lie in the span of the first four elements of this basis when AB≠BAAB\not= BA.Comment: 11 pages, 1 figure. Some typos where corrected in this new versio
    • …
    corecore